Dynamically Ordered Probabilistic Choice Logic Programming
نویسندگان
چکیده
We present a framework for decision making under uncertainty where the priorities of the alternatives can depend on the situation at hand. We design a logic-programming language, DOP-CLP, that allows the user to specify the static priority of each rule and to declare, dynamically, all the alternatives for the decisions that have to be made. In this paper we focus on a semantics that reflects all possible situations in which the decision maker takes the most rational, possibly probabilistic, decisions given the circumstances. Our model theory, which is a generalization of classical logic-programming model theory, captures uncertainty at the level of total Herbrand interpretations. We also demonstrate that DOP-CLPs can be used to formulate game theoretic concepts.
منابع مشابه
Vrije Universiteit Brussel Faculteit Wetenschappen Vakgroep Informatica E J I R V S C I E N U T N I a V
In this dissertation we investigate logic programming to model decision-making. To this extent, we introduce three formalisms with increasing expressiveness. The most basic one, called choice logic programming, allows circumstance-dependent decisions. The stable models of the program correspond to the rational solutions of the represented decision-problem. To support dynamic preference-based de...
متن کاملMulti-choice stochastic bi-level programming problem in cooperative nature via fuzzy programming approach
In this paper, a Multi-Choice Stochastic Bi-Level Programming Problem (MCSBLPP) is considered where all the parameters of constraints are followed by normal distribution. The cost coefficients of the objective functions are multi-choice types. At first, all the probabilistic constraints are transformed into deterministic constraints using stochastic programming approach. Further, a general tran...
متن کاملAn Ordered Choice Logic Programming Front-End for Answer Set Solvers
Ordered Choice Logic Programming (OCLP) allows for preferencebased decision-making with multiple alternatives without the burden of any form of negation. This complete absence of negation does not weaken the language as both forms (classical and as-failure) can be intuitively simulated in the language. The semantics of the language is based on the preference between alternatives, yielding both ...
متن کاملProbabilistic programs, computability, and de Finetti measures
The complexity of probabilistic models, especially those involving recursion, has far exceeded the representational capacity of graphical models. Functional programming languages with probabilistic choice operators have recently been proposed as universal representations for statistical modeling (e.g., IBAL [Pfe01], λ◦ [PPT08], Church [GMR08]). The conditional independence structure of a probab...
متن کاملLogical frameworks for specifying and reasoning about stateful and concurrent languages∗
Substructural logics, such as linear logic and ordered logic, have an inherent notion of state and state change. This makes them a natural choice for developing logical frameworks that specify evolving stateful systems. Our previous work has shown that the so-called forward reasoning fragment of ordered linear logic can be used to give clear, concise, and modular specifications of stateful and ...
متن کامل